Implement affine Schubert polynomials in ghseeli/combinatorialpolynomials.

Context:

• The repository already implements several Schubert-family constructions in schubert_polynomials.py, including ordinary, double, quantum, and quantum double Schubert polynomials.

• The user wants affine Schubert polynomials for affine permutations w \in \tilde{S}_n.

• The intended formula is:

  affine_schubert(w) = sum([w1.stanley_symmetric_function()*schubert(w2) for (w1,w2) in additive_affine_length_decomposition(w)])

• Here additive_affine_length_decomposition(w) means all pairs (w1, w2) such that:

  • w1 \in \tilde{S}_n
  • w2 \in S_n
  • w = w1 * w2
  • length(w1) + length(w2) = length(w)

Expected behavior/design guidance:

• Add support for computing affine Schubert polynomials in this library.
• Place the implementation in the existing Schubert-related module(s), most likely schubert_polynomials.py, unless a clearly better repo-consistent location emerges.
• Reuse existing repository patterns where appropriate, especially helper-style APIs like reduced_factorization_pairs and the existing Schubert-family functions.
• Use the affine decomposition formula above as the mathematical definition.
• The result should live naturally in symmetric functions with coefficients in ZZ[x_1, ..., x_n] (or a configurable base ring consistent with existing APIs).
• If the repo already has infrastructure suitable for representing symmetric functions in alphabets with polynomial coefficients, integrate with it rather than inventing a less consistent representation.
• If Sage affine permutation / affine Stanley symmetric function APIs require coercions or wrappers, implement the needed glue code.
• Prefer a practical, user-facing function API, e.g. something like affine_Schubert(...), plus any helper needed for additive affine length decompositions.
• Add doctests/tests illustrating basic usage and at least a few nontrivial examples.
• Update README documentation if appropriate to mention affine Schubert polynomials among implemented families.

Repository context already observed:

• schubert_polynomials.py contains existing functions such as reduced_factorization_pairs, quantum_Schubert, quantum_double_Schubert, and Schubert-family helper ring classes.
• multi_sf.py contains SymFnInAlphabetsRing, which may be useful for representing symmetric functions in one alphabet with polynomial coefficients.

Implementation expectations:

• Investigate the exact Sage interfaces available in this repo context for affine permutations and stanley_symmetric_function().
• Make the implementation robust to parent/coercion issues.
• Keep the code style aligned with the repository’s current style.
• Open a pull request with the implementation and tests/doc updates.

The following is the prior conversation context from the user's chat exploration (may be truncated):

User: I want to implement affine Schubert polynomials in this library. For affine permutation w \in \tilde{S}_n, can think of them as living in symmetric functions with coefficients in ZZ[x_1,...,x_n]. The formula I want to use is affine_schubert(w) = sum([w1.stanley_symmetric_function()schubert(w2)for (w1,w2) in additive_affine_length_decomposition(w)]) and the additive affine length decompositions are all pairs w1 \in \tilde{S}_n, w2 \in S_n such that w = w1w2 and \ell(w1)+\ell(w2) = \ell(w).

Assistant: Yes — the natural place is schubert_polynomials.py, and the implementation should mirror the existing pattern used for quantum_Schubert, quantum_double_Schubert, and the factorization helper reduced_factorization_pairs. The repo already centralizes Schubert-family constructions there, including the reduced-length factorization helper at reduced_factorization_pairs and the quantum Schubert construction based on a basis expansion. python name=schubert_polynomials.py url=https://github.com/ghseeli/combinatorialpolynomials/blob/aeb2f37199761f670a6d535d22061d3b905c27e8/schubert_polynomials.py#L393-L421 def reduced_factorization_pairs(w): r""" Given a permutation ``w``, return all pairs `(u,v)` such that `u \cdot v = w` and `\ell(u)+\ell(v) = \ell(w)`. """ w = Permutation(w) n = len(w) P = Permutations(n) red_words = w.reduced_words() pairs = [(P(w),P.identity()),(P.identity(),P(w))] for word in red_words: for s in range(len(word)): u = P.from_reduced_word(word[:s]) v = P.from_reduced_word(word[s:]) pairs.append((u,v)) return list(set(pairs)) and ```python name=schubert_polynomials.py url=